A characterization of poly-slender context-free languages
نویسندگان
چکیده
For a non-negative integer k, we say that a language L is k-poly-slender if the number of words of length n in L is of order O(n k). We give a precise characterization of the k-poly-slender context-free languages. The well-known characterization of the k-poly-slender regular languages is an immediate consequence of ours.
منابع مشابه
On Parikh slender context-free languages
In a recent paper we de ned and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications. TUCS Research Group Mathematical Structures of Computer Science
متن کاملChomsky-sch Utzenberger-type Representations of Poly-slender Context-free Languages
For a non-negative integer k, we say that a language L is k-poly-slender if the number of words of length n in L is of order O(nk). We give a characterization of the k-poly-slender context-free languages. The base for the structure of these languages is the structure of the Dyck language and so our characterization resembles the well-known Chomsky-Sch utzenberger characterization of context-fr...
متن کاملRecognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata
A linear-slender context-free language is a context-free language whose number of words of length n is linear in n. Its structure has been finely characterized in a work of Ilie, Rozenberg and Salomaa. Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton.
متن کاملA Decision Method for Parikh Slenderness of Context-free Languages
In a recent paper we introduced Parikh slender languages as a generalization of slender languages defined and studied by AndraSiu, Dassow, Pgun and Salomaa. Results concerning Pa&h slender languages can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented for deciding whether or not a given context-free language is Parikh slender.
متن کاملLength Considerations in Context-Free Languages
In this paper we investigate languages containing at most a bounded number of words of each length. We rst show that the context-free languages for which the number of words of every length is bounded by a xed polynomial are exactly the bounded context-free languages in the sense of Ginsburg G]. Thus, we present a length characterization for bounded context-free languages. We then study slender...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 34 شماره
صفحات -
تاریخ انتشار 2000